Classical simulators of quantum computers and no-go theorems
نویسنده
چکیده
It is discussed, why classical simulators of quantum computers escape from some no-go claims like Kochen-Specker, Bell, or recent Conway-Kochen " Free Will " theorems.
منابع مشابه
ua nt - p h / 06 05 21 9 v 1 2 5 M ay 2 00 6 Classical simulators of quantum computers and no - go theorems
It is discussed, why classical simulators of quantum computers escape from some no-go claims like Kochen-Specker, Bell, or recent Conway-Kochen " Free Will " theorems.
متن کاملQuantum analogue computing.
We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perfor...
متن کاملPhysical Quantum Algorithms
I review the differences between classical and quantum systems, emphasizing the connection between no-hidden variable theorems and superior computational power of quantum computers. Using quantum lattice gas automata as examples, I describe possibilities for efficient simulation of quantum and classical systems with a quantum computer. I conclude with a list of research directions. 2001 Physics...
متن کاملDo the laws of physics forbid the operation of time machines?
We address the question of whether it is possible to operate a time machine by manipulating matter and energy so as to manufacture closed timelike curves. This question has received a great deal of attention in the physics literature, with attempts to prove no-go theorems based on classical general relativity and various hybrid theories serving as steps along the way towards quantum gravity. De...
متن کاملTo balance a pencil on its tip: on the passive approach to quantum error correction
Quantum computers are hypothetical quantum information processing (QIP) devices that allow one to store, manipulate, and extract information while harnessing quantum physics to solve various computational problems and do so putatively more efficiently than any known classical counterpart. Despite many proofs of concept (also known as the ‘threshold theorems’, e.g., Aharonov & Ben–Or, 1996; Knil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/quant-ph/0605219 شماره
صفحات -
تاریخ انتشار 2006